A novel hybrid arithmetic optimization algorithm and salp swarm algorithm for data placement in cloud computing

نویسندگان

چکیده

In recent years, the Internet of Things (IoT) has led to spread cloud computing devices in all commercial, industrial and agricultural sectors. The use environment services is increasing exponentially with technology applications based on IoT. Fog addressing issues environments. reduces load balancing, processing, bandwidth, storage as data file replication from network closest sensors different geographic locations. There are three critical issues:—what should be replicated?—when replicated? and—where new replicas placed? These main open questions must tackled for This strategy, identification mode problem designed a multi-objective optimization modern meta-heuristic method. Therefore, hybrid method using Arithmetic Optimization Algorithm (AOA) salp swarm algorithm (SSA) proposed this paper. Firstly, metaheuristic method, (SSA), handle selection placement fog computing. Secondly, Floyd used strategy least cost path, distance, transmission performance AOASSA tackling evaluated datasets sizes. To validate set experiments was carried out AOASSA. Experiment results show superiority over its competitors terms measures, such bandwidth.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization Task Scheduling Algorithm in Cloud Computing

Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...

متن کامل

A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem

Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...

متن کامل

optimization task scheduling algorithm in cloud computing

since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. this rese...

متن کامل

Hybrid Green Scheduling Algorithm Using Genetic Algorithm and Particle Swarm Optimization Algorithm in Iaas Cloud

Cloud computing is outsourcing of computing resources over the Internet where we can be connected to remote locations and can use the services over the Internet at another location to store our important information. The cloud service requirements provide access to advanced software applications. In cloud computing, the network of remote servers is used to process data. Workflow scheduling is o...

متن کامل

A Hybrid Particle Swarm Optimization and Genetic Algorithm for Truss Structures with Discrete Variables

A new hybrid algorithm of Particle Swarm Optimization and Genetic Algorithm (PSOGA) is presented to get the optimum design of truss structures with discrete design variables. The objective function chosen in this paper is the total weight of the truss structure, which depends on upper and lower bounds in the form of stress and displacement limits. The Particle Swarm Optimization basically model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2023

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-022-07805-2